Partitioning of digital images using inclusion hierarchies with contraction mapping
نویسندگان
چکیده
منابع مشابه
Temperature Mapping Using Ultrasound Digital Images
Introduction: The success of hyperthermia depends on the accuracy of the temperature monitoring in the tumor and the surrounding normal tissue. In this study, the temperature changes were determined by computing the speckle displacement in the ultrasound digital images. Speckle tracking algorithm was used to compute the displacement. Materials and Methods: The experiment was perf...
متن کاملtemperature mapping using ultrasound digital images
introduction: the success of hyperthermia depends on the accuracy of the temperature monitoring in the tumor and the surrounding normal tissue. in this study, the temperature changes were determined by computing the speckle displacement in the ultrasound digital images. speckle tracking algorithm was used to compute the displacement. materials and methods: the experiment was perf...
متن کاملRegistration of Digital Ophthalmic Images Using Vector Mapping
This paper outlines a technique for the automated alignment of digital images of the retina under the assumption that they differ spatially by a geometric global transform. This alignment is a form of image registration. The solution is based on generating vectors from known, predominantly common points in the images to be registered. All potential transforms between the vectors are generated, ...
متن کاملHierarchies in Inclusion Logic with Lax Semantics
We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level. Arity hierarchy is shown to be strict by relating the question to the stud...
متن کاملTime-Dependent Contraction Hierarchies
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for timedependent routing that allows bidirectional query algorithms. For large realistic networks with considerable time-dependence (Germ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Computer Science and Engineering
سال: 2021
ISSN: 2231-3850,0976-5166
DOI: 10.21817/indjcse/2021/v12i3/211203147